On the Richness of the Collection of Subtrees in Random Binary Search Trees
نویسنده
چکیده
The purpose of this paper is to settle two conjectures by Flajolet, Gourdon and Martinez ( 1996). We confirm that in a random binary tree on n nodes, the expected number of different subtrees grows indeed as 0 (n/ log n). Secondly, if K is the largest integer such that all possible shapes of subtrees of cardinality less than or equal to K occur in a random binary search tree, then we show that K N log n/ log log n in probability. @ 1998 Published by Elsevier Science B.V.
منابع مشابه
Profile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملApplications of Stein’s Method in the Analysis of Random Binary Search Trees
Under certain conditions, sums of functions of subtrees of a random binary search tree are asymptotically normal. We show how Stein’s method can be applied to study these random trees, and survey methods for obtaining limit laws for such functions of subtrees.
متن کاملUsing Stein’s Method to Show Poisson and Normal Limit Laws for Fringe Subtrees
We consider sums of functions of fringe subtrees of binary search trees and random recursive trees (of total size n). The use of Stein’s method and certain couplings allow provision of simple proofs showing that in both of these trees, the number of fringe subtrees of size k < n, where k → ∞, can be approximated by a Poisson distribution. Combining these results and another version of Stein’s m...
متن کاملLimit laws for functions of fringe trees for binary search trees and random recursive trees
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees and random recursive trees. The proofs use a new version of a representation by Devroye, and Stein’s method for both normal and Poisson approximation together with certain couplings. As a consequence, we give simple new proofs of the fact that the number of fringe trees of size k = kn in the binary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 65 شماره
صفحات -
تاریخ انتشار 1998